Sequential coloring versus Welsh-Powell bound
نویسندگان
چکیده
منابع مشابه
Recognizing HHD-free and Welsh-Powell Opposition Graphs
In this paper, we consider the recognition problem on two classes of perfectly orderable graphs, namely, the HHD-free and the Welsh-Powell opposition graphs (or WPOgraphs). In particular, we prove properties of the chordal completion of a graph and show that a modified version of the classic linear-time algorithm for testing for a perfect elimination ordering can be efficiently used to determin...
متن کاملRecognizing HH-free, HHD-free, and Welsh-Powell Opposition Graphs
In this paper, we consider the recognition problem on three classes of perfect graphs, namely, the HH-free, the HHDfree, and the Welsh-Powell opposition graphs (or WPO-graphs). In particular, we prove properties of the chordal completion of a graph and show that a modified version of the classic linear-time algorithm for testing for a perfect elimination ordering can be efficiently used to dete...
متن کاملA sequential coloring algorithm for finite sets
Let X be a finite set and P a hereditary property associated with the subsets of X. A partition of X into n subsets each with property P is said to be a P-n-coloring of X. The minimum n such that a P-n-coloring of X exists is defined to be the P-chromatic number of X. In this paper we give a sequential coloring algorithm for P-coloring X. From the algorithm we then get a few upper bounds for th...
متن کامل1 Lower Bound on Coloring Rooted Trees
Definition 1. (The LOCAL model) We consider an arbitrary n-node graph G = (V,E) where V = {1, 2, . . . , n}, which abstracts the communication network. Unless noted otherwise, G is a simple, undirected, and unweighted graph. There is one process on each node v ∈ V of the network. At the beginning, the processes do not know the graph G, except for knowing n, and their own unique identifier in {1...
متن کاملLower Bound on Coloring Rooted Trees
Definition 1. (The LOCAL model) We consider an arbitrary n-node graph G = (V,E) where V = {1, 2, . . . , n}, which abstracts the communication network. Unless noted otherwise, G is a simple, undirected, and unweighted graph. There is one process on each node v ∈ V of the network. At the beginning, the processes do not know the graph G, except for knowing n, and their own unique identifier in {1...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1989
ISSN: 0012-365X
DOI: 10.1016/0012-365x(89)90212-4